Investigation of the Fitness Landscapes and Multi-parent Crossover for Graph Bipartitioning
نویسندگان
چکیده
An empirical study is performed on the local-optimum space of graph bipartitioning. We examine some statistical features of the fitness landscape. They include the cost-distance correlations and the properties around the central area of local optima. The study revealed some new notable results about the properties of the fitness landscape; e.g., the central area yielded fairly good quality in the local-optimum space. We performed an experiment on a spectrum of different exploitation strengths of the central areas. From the results, it seems attractive to exploit the central area, but excessive or insufficient exploitation is not desirable.
منابع مشابه
Multi-Parent's Niche: n-ary Crossovers on NK-Landscapes
1 I n t r o d u c t i o n In previous papers the multi-parent scanning crossover and diagonal crossover were tested on numerical optimization problems, [3, 4, 5]. These tests were performed on a test suite of common EA test functions, still they were chosen somewhat arbitrarily, moreover the types of fitness landscapes they span are difficult to characterize. I t was therefore not possible to l...
متن کاملFitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning
The fitness landscape of the graph bipartitioning problem is investigated by performing a search space analysis for several types of graphs. The analysis shows that the structure of the search space is significantly different for the types of instances studied. Moreover, with increasing epistasis, the amount of gene interactions in the representation of a solution in an evolutionary algorithm, ...
متن کاملExact computation of the expectation surfaces for uniform crossover along with bit-flip mutation
a r t i c l e i n f o a b s t r a c t Keywords: Uniform crossover Bit-flip mutation Walsh decomposition Landscape theory Fitness landscapes Uniform crossover and bit-flip mutation are two popular operators used in genetic algorithms to generate new solutions in an iteration of the algorithm when the solutions are represented by binary strings. We use the Walsh decomposition of pseudo-Boolean fu...
متن کاملAntibiotic resistance landscapes: a quantification of theory-data incompatibility for fitness landscapes
Fitness landscapes are central in analyzing evolution, in particular for drug resistance mutations for bacteria and virus. We show that the fitness landscapes associated with antibiotic resistance are not compatible with any of the classical models; additive, uncorrelated and block fitness landscapes. The NK model is also discussed. It is frequently stated that virtually nothing is known about ...
متن کاملA fitness based scanning multi-parent crossover operator using a probabilistic selection
Several multi-parent crossover operators had been proposed to increase performance of genetic algorithms. The operators allow several parents to simultaneously take part in creating offspring. The operators need to balance between the two conflicting goals, exploitation and exploration. Strong exploitation allows fast convergence to succeed but can lead to premature convergence while strong exp...
متن کامل